Distributed secure state estimation with a priori sparsity information

This paper addresses the problem of distributed secure state estimation a discrete-time linear dynamical system in an adversarial environment. Much recent work on this has imposed redundancy requirements measurement and communication networks for presence attacks. In paper, authors aim to relax requirement by using prior information about be estimated. A scenario where sparsity is given especially considered, it shown that priori alleviates requirement. An algorithm then derived sufficient condition convergence given. Numerical simulations finally illustrate effectiveness algorithm.